The Joy of String Diagrams

نویسنده

  • Pierre-Louis Curien
چکیده

In the past recent years, I have been using string diagrams to teach basic category theory (adjunctions, Kan extensions, but also limits and Yoneda embedding). Using graphical notations is undoubtedly joyful, and brings us close to other graphical syntaxes of circuits, interaction nets, etc... It saves us from laborious verifications of naturality, which is built-in in string diagrams. On the other hand, the language of string diagrams is more demanding in terms of typing: one may need to introduce explicit coercions for equalities of functors, or for distinguishing a morphism from a point in the corresponding internal homset. So that in some sense, string diagrams look more like a language ”à la Church”, while the usual mathematics of, say, Mac Lane’s ”Categories for the working mathematician” are more ”à la Curry”.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonlinear Dynamics of the Rotational Slender Axially Moving String with Simply Supported Conditions

In this research, dynamic analysis of the rotational slender axially moving string is investigated. String assumed as Euler Bernoulli beam. The axial motion of the string, gyroscopic force and mass eccentricity were considered in the study. Equations of motion are derived using Hamilton’s principle, resulting in two partial differential equations for the transverse motions. The equations are ch...

متن کامل

Rewriting Context-free Families of String Diagrams

String diagrams provide a convenient graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, which is the standard way of reasoning about the morphisms of monoidal categories, rewriting string diagrams results in shorter equational proofs, because the string diagrammatic representation allows us to formally establish...

متن کامل

The Space of String Diagrams

where M is a closed, compact, oriented Riemannian manifold, LM is the space of continuous maps from the circle into M–the free loop space of M–and C∗(LM) is the complex of singular chains on LM . Inspired by an idea in [6], chain-level string topology operations were constructed in [5] using a subspace of our space of string diagrams. This subspace • has a different homotopy type from the space...

متن کامل

Equational Reasoning with Context-Free Families of String Diagrams

String diagrams provide an intuitive language for expressing networks of interacting processes graphically. A discrete representation of string diagrams, called string graphs, allows for mechanised equational reasoning by double-pushout rewriting. However, one often wishes to express not just single equations, but entire families of equations between diagrams of arbitrary size. To do this we de...

متن کامل

Reasoning with !-graphs

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can be built on this to allow the formalisation of inductive proofs in the string diagrams of compact closed and traced symmetric monoidal categories. String dia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008